Concrete Structure Design using Mixed-Integer Nonlinear Programming with Complementarity Constraints

نویسندگان

  • Andres Guerra
  • Alexandra M. Newman
  • Sven Leyffer
چکیده

We present a mixed-integer nonlinear programming (MINLP) formulation to achieve minimum-cost designs for reinforced concrete (RC) structures that satisfy building code requirements. The objective function includes material and labor costs for concrete, steel reinforcing bars, and formwork according to typical contractor methods. Restrictions enforce correct geometry of the cross-section dimensions for each element and relative sizes of cross-section dimensions of elements within the structure. Other restrictions define a stiffness and displacement correlation among all structural elements via finite element analysis. The design of minimum cost RC structures introduces a new class of optimization problems, namely, mixed-integer nonlinear programs with complementarity constraints. The complementarity constraints are used to model RC element strength and American Concrete Institute code-required safety factors. We reformulate the complementarity constraints as nonlinear equations and show that the resulting ill-conditioned MINLPs can be solved by using an off-the-shelf MINLP solver. Our work provides discrete-valued design solutions for an explicit representation of a process most often performed implicitly with iterative calculations.We demonstrate the capabilities of a mixed-integer nonlinear algorithm, MINLPBB, to find optimal sizing and reinforcing for cast-in-place beam and column elements in multistory RC structures. Problem instances contain up to 678 variables, of which 214 are integer, and 844 constraints, of which 582 are nonlinear. We solve problems to local optimality within a reasonable amount of computational time, and we find an average cost savings over typical-practice design solutions of 13 percent.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sufficient global optimality conditions for general mixed integer nonlinear programming problems

‎In this paper‎, ‎some KKT type sufficient global optimality conditions‎ ‎for general mixed integer nonlinear programming problems with‎ ‎equality and inequality constraints (MINPP) are established‎. ‎We achieve‎ ‎this by employing a Lagrange function for MINPP‎. ‎In addition‎, ‎verifiable sufficient global optimality conditions for general mixed‎ ‎integer quadratic programming problems are der...

متن کامل

Comparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints

The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...

متن کامل

A mixed integer bi-level DEA model for bank branch performance evaluation by Stackelberg approach

One of the most complicated decision making problems for managers is the evaluation of bank performance, which involves various criteria. There are many studies about bank efficiency evaluation by network DEA in the literature review. These studies do not focus on multi-level network. Wu (Eur J Oper Res 207:856–864, 2010) proposed a bi-level structure for cost efficiency at the first time. In t...

متن کامل

Validation of nominations in gas network optimization: models, methods, and solutions

In this article we investigate methods to solve a fundamental task in gas transportation, namely the validation of nomination problem: Given a gas transmission network consisting of passive pipelines and active, controllable elements and given an amount of gas at every entry and exit point of the network, find operational settings for all active elements such that there exists a network state m...

متن کامل

راهبرد پیشنهاد‌دهی همزمان نیروگاه مجازی در بازار انرژی و خدمات جانبیِ رزرو چرخان و توان راکتیو

This paper addresses the bidding problem faced by a virtual power plant (VPP) in energy, spinning reserve service, and reactive power service market simultaneously. Therefore, a non-equilibrium model based on security constraints price-based unit commitment (SCPBUC), which is take into account the supply-demand balancing and security constraints of VPP, is proposed. By the presented model, VPP ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM Journal on Optimization

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2011